An Algorithm for Finding Best Matches in Logarithmic Expected Time
نویسندگان
چکیده
منابع مشابه
AN ALGORITHM FOR FINDING THE STABILITY OF LINEAR TIME-INVARIANT SYSTEMS
The purpose of this paper is to show that the ideas and techniques of the classical methods of finding stability, such as the criteria of Leonhard and Nyquist, can be used to derive simple algorithm to verify stability. This is enhanced by evaluating the argument of the characteristic equation of a linear system in the neighbourhood of the origin of the complex plane along the imaginary axis
متن کاملAN ALGORITHM FOR FINDING THE EIGENPAIRS OF A SYMMETRIC MATRIX
The purpose of this paper is to show that ideas and techniques of the homotopy continuation method can be used to find the complete set of eigenpairs of a symmetric matrix. The homotopy defined by Chow, Mallet- Paret and York [I] may be used to solve this problem with 2""-n curves diverging to infinity which for large n causes a great inefficiency. M. Chu 121 introduced a homotopy equation...
متن کاملSST: an algorithm for finding near-exact sequence matches in time proportional to the logarithm of the database size
MOTIVATION Searches for near exact sequence matches are performed frequently in large-scale sequencing projects and in comparative genomics. The time and cost of performing these large-scale sequence-similarity searches is prohibitive using even the fastest of the extant algorithms. Faster algorithms are desired. RESULTS We have developed an algorithm, called SST (Sequence Search Tree), that ...
متن کاملSometimes-Recurse Shuffle - Almost-Random Permutations in Logarithmic Expected Time
We describe a security-preserving construction of a random permutation of domain size N from a random function, the construction tolerating adversaries asking all N plaintexts, yet employing just Θ(lgN) calls, on average, to the one-bit-output random function. The approach is based on card shuffling. The basic idea is to use the sometimes-recurse transformation: lightly shuffle the deck (with s...
متن کاملFully Dynamic Delauney Triangulation in Logarithmic Expected Time per Operation
The Delaunay Tree is a hierarchical data structure that has been introduced in [7] and analyzed in [6, 4]. For a given set of sites S in the plane and an order of insertion for these sites, the Delaunay Tree stores all the successive Delaunay triangulations. As proved before, the Delaunay Tree allows the insertion of a site in logarithmic expected time and linear expected space, when the insert...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Mathematical Software
سال: 1977
ISSN: 0098-3500,1557-7295
DOI: 10.1145/355744.355745